The Minimal Number of Subtrees with a Given Degree Sequence
نویسندگان
چکیده
In this paper, we investigate the structures of extremal trees which have the minimal number of subtrees in the set of all trees with a given degree sequence. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence π = (d1, . . . , d5, 1, . . . , 1) have been characterized.
منابع مشابه
The Number of Subtrees of Trees with Given Degree Sequence
This article investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalize the recent results of Kirk and Wang (SIAM J Discrete Math 22 (2008), 985–995). These trees coincide with those which were proven by Wang and independently Z...
متن کاملar X iv : 1 20 9 . 02 75 v 1 [ m at h . C O ] 3 S ep 2 01 2 The Number of Subtrees of Trees with Given Degree Sequence ∗
This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes the recent results of Kirk and Wang. These trees coincide with those which were proven by Wang and independently Zhang et al. to minimize the Wiener index. W...
متن کاملGreedy Trees, Subtrees and Antichains
Greedy trees are constructed from a given degree sequence by a simple greedy algorithm that assigns the highest degree to the root, the second-, third-, . . . highest degrees to the root’s neighbors, and so on. They have been shown to maximize or minimize a number of different graph invariants among trees with a given degree sequence. In particular, the total number of subtrees of a tree is max...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملPartitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d ≥ 2: (1) What is the minimum number of degree-d subtrees that partition E(T )? (2) What is the minimum number of degree-d subtrees that cover E(T )? We answer the first question by providing an explicit formula for the minimum number of subtrees, and we describe a linear time algorithm that finds the corresponding par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2015